T4 Lysozyme as a Pac-Man: How Fast Can It Chew?
نویسندگان
چکیده
منابع مشابه
TeV variability in blazars: how fast can it be?
Recent Cerenkov observations of the two BL Lac objects PKS 2155–304 and Mkn 501 revealed TeV flux variability by a factor ∼ 2 in just 3–5 minutes. Even accounting for the effects of relativistic beaming, such short timescales are challenging simple and conventional emitting models, and call for alternative ideas. We explore the possibility that extremely fast variable emission might be produced...
متن کاملPurification of Bacteriophage T4 Lysozyme*
The lysozyme of bacteriophage T4 was purified to apparent homogeneity from lysates of the phage grown on Escherichia coli. The enzyme is a single polypeptide chain of molecular weight 19,000, with a single NH&erminal methionine residue and a single COOH-terminal leuciue residue. The amino acid composition of the protein was determined. The phage lysozyme exhibits a much greater specific activit...
متن کاملPac-Man or Pac-Bot? Exploring subjective perception of players' humanity in Ms. Pac-Man
Simulating human behaviour when playing video games has been recently proposed as an interesting challenge for the research community on Artificial Intelligence. In the exploration on Machine Learning techniques for training virtual players (i.e. computer bots) to imitate the conduct of real (human) players, we are using the classic arcade game Ms. Pac-Man as testbed. Our research goal is to fi...
متن کاملClever Pac-man
In this paper we show how combining fuzzy sets and reinforcement learning a winning agent can be created for the popular Pac-man game. Key elements are the classification of the state into a few fuzzy classes that makes the problem manageable. Pac-man policy is defined in terms of fuzzy actions that are defuzzified to produce the actual Pac-man move. A few heuristics allow making the Pac-man st...
متن کاملUCT for Pac-Man
This is the written documentation of the implementation of an agent for Ms-Pac-Man for a Ms. Pac-Man simulation. The agent uses the UCT algorithm (upper confident bounds) which is becoming more prominent in the domain of artificial intelligence research. In this document you will find a description of the UCT algorithm, statements to the implementation and an evaluation of the performance.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Biophysical Journal
سال: 2012
ISSN: 0006-3495
DOI: 10.1016/j.bpj.2012.08.027